Color Revolution: A Novel Operator for Imperialist Competitive Algorithm in Solving Cloud Computing Service Composition Problem

نویسندگان

چکیده

In this paper, a novel high-performance and low-cost operator is proposed for the imperialist competitive algorithm (ICA). The operator, inspired by sociopolitical movement called color revolution that has recently arisen in some countries, referred to as (CRO). improved ICA with CRO, denoted ICACRO, significantly more efficient than ICA. On other hand, cloud computing service composition high-dimensional optimization problem become prominent recent years due unprecedented increase both number of services pool providers. study, two different types one applies CRO all countries world (ICACRO-C) solely (ICACRO-I), were used time-cost composition. ICACRO was evaluated using large-scale dataset five problems difficulty levels. Compared basic niching PSO, experimental statistical tests demonstrate ability approach an optimal solution considerably higher can be considered scalable approach. Furthermore, ICACRO-C stronger ICACRO-I terms quality respect execution time. However, differences are negligible when solving problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imperialist competitive algorithm with PROCLUS classifier for service time optimization in cloud computing service composition

Aiming to provide satisfying and value-added cloud composite services, suppliers put great effort into providing a large number of service providers. This goal, achieved by providing the ‘‘best’’ solutions, will not be guaranteed unless an efficient composite service composer is employed to choose an optimal set of required unique services (with respect to user-defined values for quality of ser...

متن کامل

An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...

متن کامل

SOLVING BLASIUS EQUATION USING IMPERIALIST COMPETITIVE ALGORITHM

In this study, a new approach isintroduced to solve Blasius differential equation using of ImperialistCompetitive Algorithm (ICA). This algorithm is inspired by competitionmechanism among Imperialists and colonies and has demonstrated excellent capabilitiessuch as simplicity, accuracy, faster convergence and better global optimumachievement in contrast to other evolutionary algorithms. The obta...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13020177